Sumset and Inverse Sumset Theory for Shannon Entropy

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sumset and Inverse Sumset Theory for Shannon Entropy

Let G = (G,+) be an additive group. The sumset theory of Plünnecke and Ruzsa gives several relations between the size of sumsets A + B of finite sets A, B, and related objects such as iterated sumsets kA and difference sets A−B, while the inverse sumset theory of Freiman, Ruzsa, and others characterises those finite sets A for which A+A is small. In this paper we establish analogous results in ...

متن کامل

An Entropy Sumset Inequality and Polynomially Fast Convergence to Shannon Capacity Over All Alphabets

We prove a lower estimate on the increase in entropy when two copies of a conditional random variable X|Y , with X supported on Zq = {0, 1, . . . , q − 1} for prime q, are summed modulo q. Specifically, given two i.i.d. copies (X1, Y1) and (X2, Y2) of a pair of random variables (X,Y ), with X taking values in Zq, we show H(X1 +X2 | Y1, Y2)−H(X|Y ) ≥ α(q) ·H(X|Y )(1−H(X|Y )) for some α(q) > 0, w...

متن کامل

The Sumset Phenomenon

Answering a problem posed by Keisler and Leth, we prove a theorem in nonstandard analysis to reveal a phenomenon about sumsets, which says that if two sets A and B are large in terms of \measure", then the sum A+B is not small in terms of \order{topology". The theorem has several corollaries about sumset phenomenon in the standard world; these are described in sections 2{4. One of these is a ne...

متن کامل

A Sumset Problem

We study the sumset A + k ·A for the first non trivial case, k = 3, where k ·A = {k · a, a ∈ A}. We prove that |A + 3 · A| ≥ 4|A| − 4 and that the equality holds only for A = {0, 1, 3}, A = {0, 1, 4}, A = 3 ·{0, . . . , n}∪(3 ·{0, . . . , n}+1) and all the affine transforms of these sets.

متن کامل

On a Sumset Problem for Integers

Let A be a finite set of integers. We show that if k is a prime power or a product of two distinct primes then |A + k ·A| > (k + 1)|A| − dk(k + 2)/4e provided |A| > (k − 1)2k!, where A + k ·A = {a + kb : a, b ∈ A}. We also establish the inequality |A + 4 ·A| > 5|A| − 6 for |A| > 5.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Combinatorics, Probability and Computing

سال: 2010

ISSN: 0963-5483,1469-2163

DOI: 10.1017/s0963548309990642